منابع مشابه
Separating Codes: Constructions and Bounds
Separating codes, initially introduced to test automaton, have revived lately in the study of fingerprinting codes, which are used for copyright protection. Separating codes play their role in making the fingerprinting scheme secure agains coalitions of pirates. We provide here better bounds, constructions and generalizations for these codes.
متن کاملNew upper bounds on separating codes - Telecommunications, 2003. ICT 2003. 10th International Conference on
Separating codes, initially introduced to test au tomaton , have revived lately in t h e s t u d y of f ingerprint ing codes, which are used for copyr ight protect ion. Separating codes play the i r role i n making t h e fiugerpr in t ing scheme secu re agains coalitions of pirates. We provide h e r e better bounds o n such codes.
متن کاملUpper Bounds on the Number of Codewords of Some Separating Codes
Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study upper bounds for separating codes. First, some new upper bound for restricted separating codes is proposed. Then we illustrate that the Upper Bound Conjecture f...
متن کاملImproved upper bounds on sizes of codes
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is the Johnson bound. We give a new upper bound which is at least as good as the Johnson bound for all values of and , and for each there are infinitely many values of for which the new bound is better than the Johnson bo...
متن کاملOn the Upper Bounds of MDS Codes
Let Mq(k) be the maximum length of MDS codes with parameters q, k. In this paper, the properties of Mq(k) are studied, and some new upper bounds ofMq(k) are obtained. Especially we obtain thatMq(q− 1) ≤ q+2(q ≡ 4(mod 6)), Mq(q− 2) ≤ q+1(q ≡ 4(mod 6)), Mq(k) ≤ q + k − 3 (q = 36(5s+ 1), s ∈ N and k = 6, 7).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2004
ISSN: 0018-9448
DOI: 10.1109/tit.2004.828140